Creating or Destroying Objects Plan in the Graphplan Framework
نویسندگان
چکیده
At present, intelligent planning in the Graphplan framework is a focus of artificial intelligence. While the Creating or Destroying Objects Planning (CDOP) is one unsolved problem of this field, one of the difficulties, too. In this paper, we study this planning problem and bring forward the idea of transforming objects to propositions, based on which we offer an algorithm, Creating or Destroying Objects in the Graphplan framework (CDOGP). Compared to Graphplan, the new algorithm can solve not only the entire problems that Graphplan do, but also a part of CDOP. It is for the first time that we introduce the idea of object-proposition, and we emphasize the discussion on the representations of creating or destroying objects operator and an algorithm in the Graphplan framework. In addition, we analyze the complexity of this algorithm. Keywords—Graphplan, object_proposition, Creating or destroying objects, CDOGP.
منابع مشابه
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditions; we seek a contingency plan that maximises the probability of reaching the goal. The Graphplan framework has proven to be highly successful at solving classical planning problems, but has not previously been applie...
متن کاملFlexible Graphplan
Traditionally, planning problems are cast in terms of imperative constraints that are either wholly satisfied or wholly violated. It is argued herein that this framework is too rigid to capture the full subtlety of many real problems. A new flexible planning problem is defined which supports the soft constraints often found in reality. A solution strategy using the Graphplan framework is descri...
متن کاملProbabilistic Planning in the Graphplan Framework
The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains In this paper we explore the extent to which its representation can be used for probabilistic planning In particular we consider an MDP style framework in which the state of the world is known but actions are probabilistic and the objective is to produce a nite horizon contingent plan wit...
متن کاملA Framework for Plan Execution in Behaviour-Based Robots
This paper presents a conceptual architecture for autonomous robots that integrates behaviour-based and goal-directed action as by following a traditional action plan. Dual Dynamics is the formalism for describing behaviourbased action. Partial-order propositional plans, which get generated by GRAPHPLAN, are used as a basis for acting goal-directedly; the concept is suitable for using other pla...
متن کاملFlexible Blackbox: Preliminary Results
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of this, we provided a new flexible definition and described a solution strategy based upon the Graphplan framework. Under this definition an action must determine how well its preconditions are met and assert a relative s...
متن کامل